Fixpoints in Temporal Description Logics
نویسندگان
چکیده
We study a decidable fixpoint extension of temporal description logics. To this end we employ and extend decidability results obtained for various temporally first-order monodic extensions of (firstorder) description logics. Using these techniques we obtain decidability and tight complexity results for various fixpoint extensions of temporal description logics.
منابع مشابه
A Tableau Proof System with Names for Modal Mu-calculus
Howard Barringer was a pioneer in the study of temporal logics with fixpoints [1]. Their addition adds considerable expressive power. One general issue is how to define proof systems for such logics. Here we examine proof systems for modal logic with fixpoints. We present a tableau proof system for checking validity of formulas which uses names to keep track of unfoldings of fixpoint variables ...
متن کاملA pr 2 00 3 TCTL Inevitability Analysis of Dense - time Systems ∗
Inevitability properties in branching temporal logics are of the syntax ∀♦φ, where φ is an arbitrary (timed) CTL formula. In the sense that ”good things will happen”, they are parallel to the ”liveness” properties in linear temporal logics. Such inevitability properties in dense-time logics can be analyzed with greatest fixpoint calculation. We present algorithms to model-check inevitability pr...
متن کاملSubsumption Checking in Conjunctive Coalgebraic Fixpoint Logics
While reasoning in a logic extending a complete Boolean basis is coNP-hard, restricting to conjunctive fragments of modal languages sometimes allows for tractable reasoning even in the presence of greatest fixpoints. One such example is the EL family of description logics; here, efficient reasoning is based on satisfaction checking in suitable small models that characterize formulas in terms of...
متن کاملTCTL Inevitability Analysis of Dense-Time Systems
Inevitability properties in branching temporal logics are of the syntax ∀♦φ, where φ is an arbitrary (timed) CTL formula. In the sense that ”good things will happen”, they are parallel to the ”liveness” properties in linear temporal logics. Such inevitability properties in dense-time logics can be analyzed with greatest fixpoint calculation. We present algorithms to model-check inevitability pr...
متن کاملReasoning in Expressive Description Logics with Fixpoints based on Automata on Infinite Trees
In the last years, the investigation on Description Logics (DLs) has been driven by the goal of applying them in several areas, such as, software engineering, information systems, databases, information integration, and intelligent access to the web. The modeling requirements arising in the above areas have stimulated the need for very rich languages, including fixpoint constructs to represent ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011